منابع مشابه
On Functions Which Are Fourier Transforms
1. Let G be a locally compact and abelian group, Gl the dual group. Through this paper, "Ml will denote the set of all bounded Radon measure n on G; this set will be considered as a Banach algebra when provided with the customary norm as the dual of the space Co(G) defined below and with the ring product defined as convolution. If /iGM1, its Fourier transform is by definition the bounded and co...
متن کاملSparse Generalized Fourier Transforms ∗
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...
متن کاملQuadratic Fourier Transforms
In this paper we shall examine the quadratic Fourier transform which is introduced by the generalized quadratic function for one order parameter in the ordinary Fourier transform. This will be done by analyzing corresponding six subcases of the quadratic Fourier transform within a reproducing kernel Hilbert spaces framework. Center for R&D in Mathematics and Applications, Department of Mathemat...
متن کاملOn a Family of Fourier Transforms
A procedure leading to specific properties of the symmetric stable distribution functions results by subjecting certain generalizations of the Bessel functions Ja{t) to a limit process. 1 There arises the question as to the existence of the corresponding distributions in case the limit process involved is omitted. The object of this note is to delimit the conditions under which the answer is af...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1985
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700004664